Generalized Ramsey theorems for r-uniform hypergraphs

نویسندگان

  • Mark Budden
  • Josh Hiller
  • Aaron Rapp
چکیده

We show that several known Ramsey number inequalities can be extended to the setting of r-uniform hypergraphs. In particular, we extend Burr’s results on tree-star Ramsey numbers, providing exact evaluations for certain hypergraph Ramsey numbers. Then we turn our attention to proving a general multicolor hypergraph Ramsey number inequality from which generalizations of results due to Chvátal and Harary and Robertson can be obtained. Finally, we consider ways in which one may generalize a more recent multicolor Ramsey number inequality due to Xiaodong, Zheng, Exoo, and Radziszowski. M. BUDDEN ET AL. /AUSTRALAS. J. COMBIN. 63 (1) (2015), 142–152 143

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3-Uniform hypergraphs of bounded degree have linear Ramsey numbers

Chvátal, Rödl, Szemerédi and Trotter [1] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. We prove that the same holds for 3-uniform hypergraphs. The main new tool which we prove and use is an embedding lemma for 3-uniform hypergraphs of bounded maximum degree into suitable 3-uniform ‘pseudo-random’ hypergraphs. keywords: hypergraphs; regularity lemm...

متن کامل

EMBEDDINGS AND RAMSEY NUMBERS OF SPARSE k-UNIFORM HYPERGRAPHS

Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [6, 23] the same result was proved for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs for any integer k ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for k-uniform hypergraphs of boun...

متن کامل

On Ramsey - Turán type theorems for hypergraphs

Let H’ be an r-uniform hypergraph. Let g=g(n; F) be the minimal integer so that any r-uniform hypergraph on n vertices and more than g edges contains a subgraph isomorphic to H’. Let e=f(n; H’, en) denote the minimal integer such that every r-uniform hypergraph on n vertices with more than e edges and with no independent set of .sn vertices contains a subgraph isomorphic to H’. We show that if ...

متن کامل

Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs

A uniform hypergraph H is called k-Ramsey for a hypergraph F , if no matter how one colors the edges of H with k colors, there is always a monochromatic copy of F . We say that H is minimal k-Ramsey for F , if H is k-Ramsey for F but every proper subhypergraph of H is not. Burr, Erdős and Lovasz [S. A. Burr, P. Erdős, and L. Lovász, On graphs of Ramsey type, Ars Combinatoria 1 (1976), no. 1, 16...

متن کامل

Directed domination in oriented hypergraphs

ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2015